Materialized View Selection Scheme for enhancing RDF Query Performance
نویسندگان
چکیده
منابع مشابه
Materialized View Selection by Query Clustering in XML Data Warehouses
XML data warehouses form an interesting basis for decision-support applications that exploit complex data. However, native XML database management systems currently bear limited performances and it is necessary to design strategies to optimize them. In this paper, we propose an automatic strategy for the selection of XML materialized views that exploit a data mining technique, more precisely th...
متن کاملMaterialized View-Based Processing of RDF Queries
The increasing interest in the RDF data model has turned the efficient processing of queries over RDF datasets to a challenging and crucial task. Indeed, the triple format of the RDF data model, along with the lack of structure that characterizes it, raise new challenges in data management both in terms of performance and scalability. In this paper, we consider improving the performance of RDF ...
متن کاملMaterialized View Selection: A Survey
This is a draft of my contribution to a book chapter (doi: 10.4018/978-1-60566-816-1.ch005). We mainly categorize and review the existing approaches to materialized view selection. View selection addresses the problem of choosing materialized views in the design process of data warehouses. Informally, it can be stated as, given an estimated query workload and possibly also sets of candidate vie...
متن کاملAn Improved Algorithm for Materialized View Selection
The data warehouse is subject oriented, integrated, nonvolatile and time-varying data sets, which is used to support management decision-making. A data warehouse stores materialized views of data from one or more sources, with the purpose of efficiently implementing Decision-support or OLAP queries. One of the most important decisions in designing a data warehouse is the selection of materializ...
متن کاملMaterialized View Selection for Multidimensional Datasets
To fulfill the requirement of fast interactive multidimensional data analysis, database systems precompute aggregate views on some subsets of dimensions and their corresponding hierarchies. However, the problem of what to precompute is difficult and intriguing. The leading existing algorithm, BPUS, has a running time that is polynomial in the number of views and is guaranteed to be within (0.63...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of the Korea Contents Association
سال: 2015
ISSN: 1598-4877
DOI: 10.5392/jkca.2015.15.12.024